Isomorphism of Regular Trees and Words
نویسندگان
چکیده
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are represented by NFAs (DFAs), the isomorphism problem for regular trees turns out to be EXPTIME-complete (resp. P-complete). In case the input automata are acyclic NFAs (acyclic DFAs), the corresponding trees are (succinctly represented) finite trees, and the isomorphism problem turns out to be PSPACE-complete (resp. Pcomplete). A linear order is regular if it is isomorphic to the lexicographic order on a regular language. A polynomial time algorithm for the isomorphism problem for regular linear orders (and even regular words, which generalize the latter) given by DFAs is presented. This solves an open problem by Ésik and Bloom. A long version of this paper can be found in [18].
منابع مشابه
On Isomorphism Theorems of Fn -Polygroups
In this paper, the notion of fuzzy n-polygroups (Fn -polygroups) is introduced and some related properties are investigated. In this regards, the concepts of normal F-subpolygroups and homomorphisms of Fn-polygroups are adopted. Also, the quotient of Fn-polygroups by defining regular relations are studied. Finally, the classical isomorphism theorems of groups are generalized to Fn-polygroups p...
متن کاملRegular networks are determined by their trees
A rooted acyclic digraph N with labelled leaves displays a tree T when there exists a way to select a unique parent of each hybrid vertex resulting in the tree T . Let Tr(N) denote the set of all trees displayed by the network N . In general, there may be many other networks M such that Tr(M) = Tr(N). A network is regular if it is isomorphic with its cover digraph. This paper shows that if N is...
متن کاملA NOTE ON THE EQUISEPARABLE TREES
Let T be a tree and n_{l}(eIT) and n_{2}(eIT) denote the number of vertices of T, lying on the two sides of the edge e. Suppose T_{l} and T_{2} are two trees with equal number of vertices, e in T_{1} and f in T_{2}. The edges e and f are said to be equiseparable if either n_{l}(eIT_{I}) = n_{l}(fIT_{2}) or n_{l}(eIT_{I}) = n_{2}(fIT_{2}). If there is an one-to-one correspondence between the ver...
متن کاملAutomata and Algebras for Infinite Words and Trees
Regular languages can be studied not just for finite words, but also for finite trees, infinite words and infinite trees. Almost all of the theory of regular languages, such as closure under boolean operations, works also for these extensions, but the constructions are significantly more challenging and mathematically interesting. For instance, automata for infinite words can be determinised un...
متن کاملOmpactification of Completely Regular Frames based on their Cozero Part
Let L be a frame. We denoted the set of all regular ideals of cozL by rId(cozL) . The aim of this paper is to study these ideals. For a frame L , we show that rId(cozL) is a compact completely regular frame and the map jc : rId(cozL)→L given by jc (I)=⋁I is a compactification of L which is isomorphism to its Stone–Čech compactification and is proved that jc have a right adjoint rc : L →...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011